Qualitative Properties of Α-fair Policies in Bandwidth-sharing Networks

نویسنده

  • Y. Zhong
چکیده

We consider a flow-level model of a network operating under an α-fair bandwidth sharing policy (with α > 0) proposed by Roberts and Massoulié (2000). This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows in a communication network. We study the transient properties as well as the steady-state distribution of the model. In particular, for α ≥ 1, we obtain bounds on the maximum number of flows in the network over a given time horizon, by means of a maximal inequality derived from the standard Lyapunov drift condition. As a corollary, we establish the full state space collapse property for all α ≥ 1. For the steady-state distribution, we obtain explicit exponential tail bounds on the number of flows, for any α > 0, by relying on a norm-like Lyapunov function. As a corollary, we establish the validity of the diffusion approximation developed by Kang et al (2009), in steady state, for the case where α = 1 and under a local traffic condtion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of bandwidth-sharing policies in a linear network

In bandwidth-sharing networks, users of various classes require service from different subsets of shared resources simultaneously. These networks have been proposed to analyze the performance of wired and wireless networks. For general arrival and service processes, we give sufficient conditions in order to compare sample-path wise the workload and the number of users under different policies i...

متن کامل

Network iso-elasticity and weighted α-fairness

Abstract: When a communication network’s capacity increases, it is natural to want the bandwidth allocated to increase to exploit this capacity. But, if the same relative capacity increase occurs at each network resource, it is also natural to want each user to see the same relative benefit, so the bandwidth allocated to each route should remain proportional. We will be interested in bandwidth ...

متن کامل

Performance of Multi-beam Satellite Systems With A New Bandwidth Sharing Algorithm

An efficient resource allocation is important to guarantee the best performance with a fair distribution of multi-beam satellite capacity to provide satellite multimedia and broadcasting services. In this way, available bandwidth and capacity problems in new satellite system likes Multi-Input-Multi-Output (MIMO), exploring new techniques for enhancing spectral efficiency in satellite communicat...

متن کامل

Bandwidth Scheduling for Wide - Area ATMNetworks Using Virtual

| This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area ATM networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buuers. Packetized generalized processor sharing is brieey discussed and a minimum-bandwidth result for self-clocked f...

متن کامل

Early Fair Drop : A New Bu er Management

In this paper, we investigate the eeectiveness of packet-drop mechanisms in conjunction with fair queuing link scheduling and hierarchical link sharing. Under fair queuing, the link share of a ow changes dynamically due to the arrivals and departures of ows and their bursts. This phenomenon becomes more pronounced in the case of hierarchical link sharing. Packet-drop mechanisms play an integral...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011